Decidability of performance equivalence for basic parallel processes

Verifying Performance Equivalence for Timed Basic Parallel Processes

We address the problem of deciding performance equivalence for a timed process algebra in which actions are urgent and durational, and where parallel components have independent local clocks. This process algebra can be seen as a timed extension of BPP, a process algebra giving rise to infinite-state processes. While bisimulation was known to be decidable for BPP with a non elementary complexit...

Decidability of Bisimulation Equivalence for Pushdown Processes

We show that bisimulation equivalence is decidable for pushdown automata without ǫ-transitions.

On coincidence of distributed and performance equivalence for Basic Parallel Processes

We prove that distributed bisimilarity and a timed equivalence called performance equivalence coincide on Basic Parallel Processes.

Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes

Decidability of strong bisimulation of basic parallel processes using Hilbert's basis theorem

We will apply some algebraic results, namely Hilbert's basis theorem and Grr obner bases, to get a diierent technique for proving decidability of strong bisimulation of basic parallel processes.